On generalized multipoint root-solvers with memory
نویسندگان
چکیده
The improved versions of the Kung–Traub family and the Zheng–Li–Huang family of n-point derivative free methods for solving nonlinear equations are proposed. The convergence speed of the modified families is considerably accelerated by employing a self-correcting parameter. This parameter is calculated in each iteration using information from the current and previous iteration so that the proposed families can be regarded as the familieswithmemory. The increase of convergence order is attainedwithout any additional function evaluationsmeaning that these familieswithmemory possess high computational efficiency. Numerical examples are included to confirm theoretical results anddemonstrate convergence behaviour of the proposed methods. © 2012 Elsevier B.V. All rights reserved.
منابع مشابه
A Class of Three-Step Derivative-Free Root Solvers with Optimal Convergence Order
A class of three-step eighth-order root solvers is constructed in this study. Our aim is fulfilled by using an interpolatory rational function in the third step of a three-step cycle. Each method of the class reaches the optimal efficiency index according to the Kung-Traub conjecture concerning multipoint iterative methods without memory. Moreover, the class is free from derivative calculation ...
متن کاملInterpolatory multipoint methods with memory for solving nonlinear equations
A general way to construct multipoint methods for solving nonlinear equations by using inverse interpolation is presented. The proposed methods belong to the class of multipoint methods with memory. In particular, a new two-point method with memory with the order ð5þ ffiffiffiffiffiffi 17 p Þ=2 4:562 is derived. Computational efficiency of the presented methods is analyzed and their comparison ...
متن کاملA Limited-Memory Multipoint Symmetric Secant Method for Bound Constrained Optimization
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in some recently introduced quadratic solvers. A limited-memory multipoint symmetric secant method for approximating the Hessian is presented. Positive-definiteness of the Hessian approximation is not enforced. A combina...
متن کاملAn Optimal Biparametric Multipoint Family and Its Self-Acceleration with Memory for Solving Nonlinear Equations
In this paper, a family of Steffensen-type methods of optimal order of convergence with two parameters is constructed by direct Newtonian interpolation. It satisfies the conjecture proposed by Kung and Traub (J. Assoc. Comput. Math. 1974, 21, 634–651) that an iterative method based on m evaluations per iteration without memory would arrive at the optimal convergence of order 2m−1. Furthermore, ...
متن کاملTR-2006007: Root-Finding with Eigen-Solving
We survey and extend the recent progress in polynomial root-finding based on reducing the problem to eigen-solving for highly structured generalized companion matrices. In particular we cover the selection of the eigen-solvers and the matrices and the resulting benefits based on exploiting matrix structure. No good estimates for global convergence of the basic eigen-solvers have been proved, bu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Computational Applied Mathematics
دوره 236 شماره
صفحات -
تاریخ انتشار 2012